Broken family sensitivity in transitive systems
نویسندگان
چکیده
Let $(X,T)$ be a topological dynamical system, $n\geq 2$ and $\mathcal{F}$ Furstenberg family of subsets $\mathbb{Z}_+$. is called broken $\mathcal{F}$-$n$-sensitive if there exist $\delta>0$ $F\in\mathcal{F}$ such that for every opene (non-empty open) subset $U$ $X$ $l\in\mathbb{N}$, $x_1^l,x_2^l,\dotsc,x_n^l\in U$ $m_l\in \mathbb{Z}_+$ satisfying $d(T^k x_i^l, T^k x_j^l)> \delta,\ \forall 1\leq i0$. also obtain specific properties them by analyzing factor maps to their maximal equicontinuous factors. Furthermore, we examples distinguish different kinds sensitivity.
منابع مشابه
Block sensitivity of minterm-transitive functions
Boolean functions with symmetry properties are interesting from a complexity theory perspective; extensive research has shown that these functions, if nonconstant, must have high ‘complexity’ according to various measures. In recent work of this type, Sun gave bounds on the block sensitivity of nonconstant Boolean functions invariant under a transitive permutation group. Sun showed that all suc...
متن کاملIncreasing Sequence Search Sensitivity with Transitive Alignments
Sequence alignment is an important bioinformatics tool for identifying homology, but searching against the full set of available sequences is likely to result in many hits to poorly annotated sequences providing very little information. Consequently, we often want alignments against a specific subset of sequences: for instance, we are looking for sequences from a particular species, sequences t...
متن کاملA Family of Half-Transitive Graphs
We construct an infinite family of half-transitive graphs, which contains infinitely many Cayley graphs, and infinitely many non-Cayley graphs.
متن کاملA Novel Multi-parameter Family of Quantum Systems with Partially Broken N -fold Supersymmetry
We develop a systematic algorithm for constructing an N -fold supersymmetric system from a given vector space invariant under one of the supercharges. Applying this algorithm to spaces of monomials, we construct a new multi-parameter family of N -fold supersymmetric models, which shall be referred to as “type C”. We investigate various aspects of these type C models in detail. It turns out that...
متن کاملA family of binary completely transitive codes and distance-transitive graphs
In this paper we construct new family of binary linear completely transitive (and, therefore, completely regular) codes. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ ≥ 2, there exist two codes in the constructed class of codes with d = 3, covering radius ρ and length ( 4 ρ 2 ) and ( 4 ρ+2 2 ) , respectively. These new completely tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2022
ISSN: ['0022-247X', '1096-0813']
DOI: https://doi.org/10.1016/j.jmaa.2022.126175